Legendre Series Analysis and Computation via Composed Abel–Fourier Transform
نویسندگان
چکیده
Legendre coefficients of an integrable function f(x) are proved to coincide with the Fourier a nonnegative index suitable Abel-type transform itself. The numerical computation N can thus be carried out efficiently in O(NlogN) operations by means single fast f(x). Symmetries associated exploited further reduce computational complexity. dual problem calculating sum expansions at prescribed set points is also considered. We prove that series written as Abel series. This fact allows us state efficient algorithm for evaluation expansions. Finally, some tests illustrated exemplify and confirm theoretical results.
منابع مشابه
Recurrences and Legendre Transform
A binomial identity ((1) below), which relates the famous Apéry numbers and the sums of cubes of binomial coefficients (for which Franel has established a recurrence relation almost 100 years ago), can be seen as a particular instance of a Legendre transform between sequences. A proof of this identity can be based on the more general fact that the Apéry and Franel recurrence relations themselve...
متن کاملThe Legendre transform
f((1− t)x1 + tx2) ≤ (1− t)f(x1) + tf(x2), x1, x2 ∈ C, 0 ≤ t ≤ 1, then f : X → R is convex. Proof. Let (x1, α1), (x2, α2) ∈ epi f and 0 ≤ t ≤ 1. The fact that the pairs (xi, αi) belong to epi f means in particular that f(xi) < ∞, and hence that xi ∈ C, as otherwise we would have f(xi) =∞. But (1− t)(x1, α1) + t(x2, α2) = ((1− t)x1 + tx2, (1− t)α1 + tα2), and, as x1, x2 ∈ C, f((1− t)x1 + tx2) ≤ (...
متن کاملLegendre Ramanujan Sums transform
In this paper, Legendre Ramanujan Sums transform(LRST) is proposed and derived by applying DFT to the complete generalized Legendre sequence (CGLS) matrices. The original matrix based Ramanujan Sums transform (RST) by truncating the Ramanujan Sums series is nonorthogonal and lack of fast algorithm, the proposed LRST has orthogonal property and O(Nlog2N) complexity fast algorithm. The LRST trans...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملSuboptimal control of linear delay systems via Legendre series
A method for finding the suboptimal control of linear delay systems with a quadratic cost functional using Legendre series is discussed. The state variable, state delay, state rate, and the control vector are expanded in the shifted Legendre series with unknown coefficients. The relation between the coefficients of the state rate with state variable is provided and the necessary condition of op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2023
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym15061282